A RFID yoking proof protocol to preserve an offline verification using the commitment disclosure
نویسندگان
چکیده
A RFID (Radio Frequency Identification) yokingproof provides a verification manner that a pair of RFID tags is scanned simultaneously by one reader device to guarantee the physical proximity of multiple objects. However, the previous studies provide the verification that requires the online verifier. The connectivity between a reader and a verifier limits the practicality of a yoking proof. In this paper, we propose an offline yoking proof protocol to preserve the offline verification that does not require the online verifier. In addition, the protocol for a pair of tags is easily extended to the one for multiple tags without additional expensive devices. Our analysis shows that the proposed protocol provides offline verification securely and effectively. Keywords— Anonymity, Privacy, RFID, Verification, Yoking proof
منابع مشابه
Secret Disclosure attack on Kazahaya, a Yoking-Proof For Low-Cost RFID Tags
Peris-Lopez et al. recently provides some guidelines that should be followed to design a secure yoking-proof protocol [10]. In addition, conforming to those guidelines and EPC C1 G2, they presented a yoking-proof for low-cost RFID tags, named Kazahaya. However, in this letter, we scrutinize its security showing how an passive adversary can retrieve secret parameters of patient’s tag in cost of ...
متن کاملFlaws on RFID grouping-proofs. Guidelines for future sound protocols
During the last years many RFID authentication protocols have been proposed with major or minor success (van Deursen and Radomirović, 2008). Juels (2004) introduced a different and novel problem that aims to evidence that two tags have been simultaneously scanned. He called this kind of evidence a yoking-proof that is supposed to be verifiable offline. Then, some authors suggested the generaliz...
متن کاملOn the Security of RFID Group Scanning Protocols
A RFID group scanning protocol enables a RFID reader to produce a proof of co-existence of multiple RFID tags. This type of protocol is also referred to as yoking-proof, grouping-proof and co-existence proof. In this letter, we show that all of the previous group scanning protocols are vulnerable to relay attack. key words: yoking-proof, grouping-proof, co-existence-proof, relay attack
متن کاملA Novel Mutual Authentication Scheme Based on Quadratic Residues of RFID Tags
In 2004, Ari Juels [1] proposed a Yoking-Proofs protocol for RFID systems. The aim is to permit tags to generate a proof which is verifiable off-line by a trusted entity even when the readers are potentially untrusted. However, we find that their protocol not only doesn’t possess the anonymity property but also suffers from both of the off-line and replay attacks. In 2006, Kirk H.M. Wong et al....
متن کاملA High-security RFID Grouping Proof Protocol
Several categories of RFID authentication protocols have been proposed recently, among which Jules [5] introduced a novel research direction, named yoking proof. It is used to solve the problem that two tags have to be scanned simultaneously for some reasons. Afterwards, the yoking proof was developed into the grouping proof protocol and many such protocols have been presented. However there ar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014